Unique fixpoint induction for message-passing process calculi
نویسندگان
چکیده
منابع مشابه
Unique fixpoint induction for message-passing process calculi
We present a proof system for message-passing process calculi with recursion. The key inference rule to deal with recursive processes is a version of Unique Fixpoint Induction for process abstractions. We prove the proof system is sound and also complete for a restricted form of regular message-passing processes. We also show that the system is incomplete in general and discuss more powerful ex...
متن کاملUnique Fixpoint Induction for Value-passing Processes
We investigate the use of unique xpoint induction as a proof method for value-passing process languages with recursion. An intuitive generalisation of unique xpoint induction based on loop invariants for symbolic graphs yields strong completeness results; we give an axiomatic characterisation of both late and early observational congruence for a class of fully parameterised processes. This new,...
متن کاملMessage–passing Implementation for Process Functional Language1
In this paper we introduce the concept an implementation of distributed programming in PFL – a process functional programming language and describe implementation of concurrency in other Haskell–like parallel functional languages – Concurrent Haskell and GpH. The process of writing parallel program is complicated by the need to specify both the parallel behaviour of the program and the algorith...
متن کاملStatic Analysis of Value-Passing Process Calculi
Standard approaches to providing a semantics for value passing process calculi involve an expansion into a basic calculus which only involves pure synchroni-sation. When the semantics is intended to provide a basis for static analysis of properties of the values, this expansion leads to an unacceptable loss of information. In this paper we present a model of value passing process calculi based ...
متن کاملA congruence rule format for name-passing process calculi
We introduce a GSOS-like rule format for name-passing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a natural behavioural equivalence — a form of open bisimilarity — is a congruence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2001
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(01)00008-9